Decidability and Complexity of Definability within the Class of All Partitions
نویسندگان
چکیده
This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
منابع مشابه
Modal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملDiophantine Definability and Decidability in the Extensions of Degree 2 of Totally Real Fields
We investigate Diophantine definability and decidability over some subrings of algebraic numbers contained in quadratic extensions of totally real algebraic extensions of Q. Among other results we prove the following. The big subring definability and undecidability results previously shown by the author to hold over totally complex extensions of degree 2 of totally real number fields, are shown...
متن کاملDefinability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (resp. equi-column) predicate constraining two time points to belong to the same layer (resp. column) and on the horizontal (resp. vertical) successor predicate relating a tim...
متن کاملRepresentability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-or...
متن کامل